An Enhanced Ant Colony System for Solving Vehicle Routing Problem with Time Window
نویسندگان
چکیده
منابع مشابه
An Enhanced Ant Colony System for Solving Vehicle Routing Problem with Time Window
Vehicle Routing Problem with Time Window (VRPTW), an extension of VRP, is a complex combinatorial problem having many real life applications. It can be described as the problem of minimizing the total route cost while satisfying the capacity and time window constraint. Ant Colony System (ACS) is a meta heuristic that is often applied to solve VRPTW. In this paper an attempt has been made to enh...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملTime Dependent Vehicle Routing Problem with an Ant Colony System
IDSIA-02-03 Abstract The Time Dependent Vehicle Routing Problem, TDVRP, consists in optimally routing a fleet of vehicles of fixed capacity when the traveling times are dependent on time, that is, the time of the day when the trip on a leg was initiated. The delivery to a customer must also satisfy the customer’s delivery time window. The optimization consists in finding the solution that minim...
متن کاملsolving the vehicle routing problem with simultaneous pickup and delivery by an effective ant colony optimization
one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...
متن کاملUsing an Ant Colony approach for Solving capacitated Vehicle Routing Problem with time Windows
In this paper, a capacitated vehicle routing problem with time windows (CVRPTW) is presented. In this work, a new idea for calculating the heuristic value to improve the performance of ant colony algorithms when solving capacitated vehicle routing problems with hard time windows is proposed. The performance of the model and the heuristic approach are evaluated by Solomon’s VRPTW benchmark probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/12794-0080